// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
int lcm(int a,int b)
{
	return a*b/__gcd(a,b);
}
int zhi(int n)
{
	//int no_prime[n+1] = {0};//先假定全部为素数。找到一个数不是素数，就把这个值变为1
	vector<int> no_prime(n+1);
	int i, j;
	int count = 0;
	for (i = 2; i<= n; i++)
	{
		if (!no_prime[i])//是素数
		{
			count++;
			for (j = i * i; j <= n; j += i)//将以i为质因子合数全部标记为1
				no_prime[j] = 1;
		}
	}
	return count;
}
signed main()
{
	int t=1;
	cin>>t;
	vector<int> dp(1e7);
	while(t--)
	{
		int n;
		cin>>n;
		int ans=0;
		for(int i=1;i<=n-1;i++)
		{
			if(!dp[n/i])dp[n/i]=zhi(n/i);
			ans+=dp[n/i];
		}
		cout<<ans<<endl;
	}
	return 0;
}
